Inimum network problem and its time - based polynomial algorithm 最小网络问题及其多项式时间算法
A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs 一个求外平面图最小反馈点集的多项式时间算法
That is to say , we can not use any polynomial algorithm to solve this kind of problems 也就是说,不能用任何已知的多项式算法求解这种问题。
Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get 讨论了无向网络容量扩充的4种特殊问题,给出了相应的强多项式算法
Furthermore , the vertex - neighbor - scattering number of trees is discussed in details . the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs , the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees 第四章主要定义图的边邻域离散数,给出一些基本图的边邻域离散数值,图的边邻域离散数的界,树的边邻域离散数的一个多项式算法。